Degree-growth of Monomial Maps
نویسندگان
چکیده
For projectivizations of rational maps Bellon and Viallet defined the notion of algebraic entropy using the exponential growth rate of the degrees of iterates. We want to call this notion to the attention of dynamicists by computing algebraic entropy for certain rationalmaps of projective spaces (Theorem6.2) and comparing it with topological entropy (Theorem 5.1). The particular rational maps we study are monomial maps (Definition 1.2), which are closely related to toral endomorphisms. Theorems 5.1 and 6.2 imply that the algebraic entropy of amonomialmap is always bounded above by its topological entropy, and that the inequality is strict if the defining matrix has more than one eigenvalue outside the unit circle. Also, Bellon and Viallet conjectured that the algebraic entropy of every rational map is the logarithm of an algebraic integer, and Theorem 6.2 establishes this for monomial maps. However, a simple example using a monomial map shows that a stronger conjecture of Bellon and Viallet is incorrect, in that the sequence of algebraic degrees of the iterates of a rational map of projective space need not satisfy a linear recurrence relation with constant coefficients.
منابع مشابه
Combinatorics of Cremona monomial maps
One studies Cremona monomial maps by combinatorial means. Among the results is a simple integer matrix theoretic proof that the inverse of a Cremona monomial map is also defined by monomials of fixed degree, and moreover, the set of monomials defining the inverse can be obtained explicitly in terms of the initial data. A neat consequence is drawn for the plane Cremona monomial group, in particu...
متن کاملPolynomials Constant on a Hyperplane and Cr Maps of Hyperquadrics
We prove a sharp degree bound for polynomials constant on a hyperplane with a fixed number of distinct monomials for dimensions 2 and 3. We study the connection with monomial CR maps of hyperquadrics and prove similar bounds in this setup with emphasis on the case of spheres. The results support generalizing a conjecture on the degree bounds to the more general case of hyperquadrics. 2000 Math....
متن کاملVarieties with maximum likelihood degree one
We show that algebraic varieties with maximum likelihood degree one are exactly the images of reduced A-discriminantal varieties under monomial maps with finite fibers. The maximum likelihood estimator corresponding to such a variety is Kapranov’s Horn uniformization. This extends Kapranov’s characterization of A-discriminantal hypersurfaces to varieties of arbitrary codimension.
متن کاملOn the Complexity of Sparse Elimination
Sparse elimination exploits the structure of a set of multivariate polynomials by measuring complexity in terms of Newton polytopes. We examine polynomial systems that generate 0-dimensional ideals: a generic monomial basis for the coordinate ring of such a system is de ned from a mixed subdivision. We o er a simple proof of this known fact and relate the computation of a monomial basis to the ...
متن کاملNormal Forms, Hermitian Operators, and Cr Maps of Spheres and Hyperquadrics
We prove and organize some results on the normal forms of Hermitian operators composed with the Veronese map. We apply this general framework to prove two specific theorems in CR geometry. First, extending a theorem of Faran, we classify all real-analytic CR maps between any hyperquadric in C and any hyperquadric in C, resulting in a finite list of equivalence classes. Second, we prove that all...
متن کامل